The range of repetition in reduced decompositions

Given a permutation w, we look at the range of how often simple reflection σk appears in reduced decompositions w. We compute minimum and give sharp upper bound on maximum. That is terms 321- 3412-patterns specifically as they relate value position to k. also characterize when that maximum are equal, refining previous result braid moves equivalent 321-patterns.